Formal languages - PDFSEARCH.IO - Document Search Engine

Formal languages
Results: 2429

#	Item
321	IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. XX, NO. Y, YEAR 100 Inference of Message Sequence Charts Rajeev Alur, Kousha Etessami, Mihalis Yannakakis Add to Reading List Source URL: www.cis.upenn.edu Language: English - Date: 2006-06-22 11:47:16 Microsoft Cluster Server Message Sequence Chart Mathematics Computing Applied mathematics Formal languages Automata theory Model theory
322	Building a Semantic Parser Overnight Yushi Wang∗ Stanford University Jonathan Berant∗ Stanford University Add to Reading List Source URL: nlp.stanford.edu Language: English - Date: 2015-05-30 04:17:55 Language Theoretical computer science Computational linguistics Categorial grammar Formal grammar Parsing Syntax Semantics Boolean algebra Formal languages Linguistics Grammar
323	Regular Expressions with Binding over Data Words for Querying Graph Databases Leonid Libkin1 , Tony Tan2 , and Domagoj Vrgoˇc3 1 2 Add to Reading List Source URL: alpha.uhasselt.be Language: English - Date: 2013-09-27 07:35:34 Automata theory Applied mathematics Regular expression FO Structure Formal languages Mathematics Theoretical computer science
324	The Control of Searching and Backtracking in String Pattern Matching* Ralph E. Griswold TR 82-20 Add to Reading List Source URL: www.cs.arizona.edu Language: English - Date: 2014-02-09 10:26:58 Pattern matching Formal languages SNOBOL Regular expressions Operations research SPITBOL compiler Heuristic Icon Backtracking Computing Software engineering Computer programming
325	Decision Problems for Additive Regular Functions Add to Reading List Source URL: www.cis.upenn.edu Language: English - Date: 2013-04-29 09:21:06 Mathematics Models of computation Metalogic Structure Universal algebra FO Model theory String Symbol Automata theory Theoretical computer science Formal languages
326	THE COMPLEXITY OF THE FIRST-ORDER THEORY OF GROUND TREE REWRITE GRAPHS ¨ STEFAN GOLLER AND MARKUS LOHREY Universit¨at Bremen, Germany Add to Reading List Source URL: www.informatik.uni-bremen.de Language: English - Date: 2014-06-19 07:22:27 Formal languages Automata theory Tree decomposition Graph Tree Structure Rewriting Binary tree Matching Mathematics Graph theory Theoretical computer science
327	2005 Paper 4 Question 1 Compiler Construction (a) A (phrase-structured) grammar is often defined to be a 4-tuple (N, T, R, S) where R is a set of production rules. Explain what the other components of the 4-tuple are. E Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2014-06-09 10:18:05 Computing Programming language implementation Compiling tools Compiler construction Acronyms Yacc Lex Parsing Formal grammar Formal languages Software Parser generators
328	TUGboat, Volume), NoBibliography Prettyprinting and Syntax Checking Nelson H. F. Beebe Add to Reading List Source URL: www.math.utah.edu Language: English - Date: 2003-08-23 19:28:09 Formal languages Scripting languages Procedural programming languages Pattern matching BibTeX TeX AWK INI file C Computing Software Cross-platform software
329	Light Regular Medium SemiBold Bold ExtraBold Add to Reading List Source URL: a2-type.co.uk Language: English - Date: 2014-02-03 15:42:51 Theoretical computer science Regular language Formal grammar Chomsky hierarchy Regular grammar Regular expression Programming language Parsing Cyrillic script Formal languages Combinatorics Mathematics
330	Formal verification of a realistic compiler Xavier Leroy INRIA Paris-Rocquencourt Domaine de Voluceau, B.P. 105, 78153 Le Chesnay, France Add to Reading List Source URL: cristal.inria.fr Language: English - Date: 2009-04-07 07:40:29 Compilers Programming language implementation Functional languages Formal methods Compiler correctness Compiler Compcert Xavier Leroy Code generation Software Computing Compiler construction

UPDATE